Review on computational methods for Lyapunov functions

Lyapunov functions are an essential tool in the stability analysis of dynamical systems, both in theory and applications. They provide sufficient conditions for the stability of equilibria or more general invariant sets, as well as for their basin of attraction. The necessity, i.e. the existence of Lyapunov functions, has been studied in converse theorems, however, they do not provide a general method to compute them. Because of their importance in stability analysis, numerous computational construction methods have been developed within the Engineering, Informatics, and Mathematics community. They cover different types of systems such as ordinary differential equations, switched systems, non-smooth systems, discrete-time systems etc., and employ di_erent methods such as series expansion, linear programming, linear matrix inequalities, collocation methods, algebraic methods, set-theoretic methods, and many others. This review brings these different methods together. First, the different types of systems, where Lyapunov functions are used, are briefly discussed. In the main part, the computational methods are presented, ordered by the type of method used to construct a Lyapunov function

Numerical Approach to Construction of Lyapunov Function for Nonlinear Stability Analysis

Abstract: This study proposes a numerical approach using Adaptive Tabu search (ATS) to construct Lyapunov function that maximizes region of attraction. The proposed methods is directly useful for stability analysis of nonlinear dynamical systems. Two illustrative examples including a synchronous generator possessing multiple equilibriums and a non-autonomous system are given to demonstrate the practicality and effectiveness of the approach